Peripheral and inner points
نویسندگان
چکیده
منابع مشابه
A new kind of inner superefficient points
In this paper, some properties of the interior of positive dual cones are discussed. With the help of dilating cones, a new notion of inner superefficient points for a set is introduced. Under the assumption of near cone-subconvexlikeness, by applying the separation theorem for convex sets, the relationship between inner superefficient points and superefficient points is established. Compared t...
متن کاملThe Traveling Salesman Problem with Few Inner Points
We study the traveling salesman problem (TSP) in the 2-dimensional Euclidean plane. The problem is NP-hard in general, but trivial if the points are in convex position. In this paper, we investigate the influence of the number of inner points (i.e., points in the interior of the convex hull) on the computational complexity of the problem. We give two simple algorithms for this problem. The firs...
متن کاملThe Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior of the convex hull). As a case study, we consider the minimum weight triangulation problem. Finding a minimum weight triangulation for a set of n points in the plane is not known to be NP-hard nor so...
متن کاملOptimal convex partitions of point sets with few inner points
We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set P of n points the algorithm runs in O(2kn +n logn) time. The parameter k is the number of points in P lying in the interior of the convex hull of P .
متن کاملEuclidean TSP with Few Inner Points in Linear Space
Given a set of n points in the Euclidean plane, such that just k points are strictly inside the convex hull of the whole set, we want to find the shortest tour visiting every point. The fastest known algorithm for the version when k is significantly smaller than n, i.e., when there are just few inner points, works in O(k √ kn) time [Knauer and Spillner, WG 2006], but also requires space of orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1970
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-69-3-253-266